A degree characterisation of pancyclicity
نویسندگان
چکیده
A graph G of order n is said to be in the class O(n1) if deg(u)+deg(v)>n1 for every pair of nonadjacent vertices II, VE V(G). We characterise the graphs in O(n1) which are pancyclic.
منابع مشابه
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
a r t i c l e i n f o a b s t r a c t The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, ...
متن کاملNode-pancyclicity and edge-pancyclicity of hypercube variants
Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...
متن کاملPanconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements
In this paper, we deal with the graph G0⊕G1 obtained from merging two graphs G0 and G1 with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in G1. The main problems studied are how fault-panconnectivity and fault-pancyclicity of G0 and G1 are translated into fault-panconnectivity and fault-pancyclicity of G0⊕G1, respectively. Many interconnection networks suc...
متن کاملA neighborhood and degree condition for pancyclicity and vertex pancyclicity
Let G be a 2-connected graph of order n. For any u ∈ V (G) and l ∈ {m,m + 1, . . . , n}, if G has a cycle of length l, then G is called [m,n]pancyclic, and if G has a cycle of length l which contains u, then G is called [m,n]-vertex pancyclic. Let δ(G) be a minimum degree ofG and let NG(x) be the neighborhood of a vertex x in G. In [Australas. J. Combin. 12 (1995), 81–91] Liu, Lou and Zhao prov...
متن کاملPairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
A graph G on n vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to n. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a 2-connected graph to be Hamiltonian. Motivated by Fan’s result, we say that an induced subgraph H of G is f1-heavy if for every pair of vertices u, v ∈ V (H), dH(u,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 127 شماره
صفحات -
تاریخ انتشار 1994